Circle Separability Queries in Logarithmic Time
نویسندگان
چکیده
In this paper we preprocess a set P of n points so that we can answer queries of the following form: Given a convex m-gon Q, report the minimum circle containing P and excluding Q. Our data structure can be constructed in O(n log n) time using O(n) space, and answers queries in O(log n+ logm) time.
منابع مشابه
بهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملImprovement of the Analytical Queries Response Time in Real-Time Data Warehouse using Materialized Views Concatenation
A real-time data warehouse is a collection of recent and hierarchical data that is used for managers’ decision-making by creating online analytical queries. The volume of data collected from data sources and entered into the real-time data warehouse is constantly increasing. Moreover, as the volume of input data to the real time data warehouse increases, the interference between online loading ...
متن کاملSymplectic 4–manifolds with a Free Circle Action
Let M be a symplectic 4–manifold admitting a free circle action. In this paper we show that, modulo suitable subgroup separability assumptions, the orbit space N admits a fibration over the circle. The separability assumptions are known to hold in several cases: in particular, this result covers the case where N has vanishing Thurston norm, or is a graph manifold. Furthermore, combining this re...
متن کاملDynamic circle separability between convex polygons
Let P, Q be two polygons of n and m vertices respectively. A circle containing P and whose interior does not intersect Q is called a separating circle. We propose an algorithm for finding the minimum separating circle between a fixed convex polygon P and query convex polygon Q. P and Q are given as ordered lists of vertices (sorted according to their order of appearance along the convex hulls o...
متن کاملارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012